Balancing and scheduling assembly lines with human-robot collaboration tasks

نویسندگان

چکیده

In light of the Industry 5.0 trend towards human-centric and resilient industries, human-robot collaboration (HRC) assembly lines can be used to enhance productivity workers’ well-being, provided that optimal allocation tasks available resources determined. This study investigates line balancing problem (ALBP), considering HRC. problem, abbreviated ALBP-HRC, arises in advanced manufacturing systems, where humans collaborative robots share same workplace simultaneously perform parallel or collaboration. Driven by need solve more complex line-balancing problems found automotive industry, this aims address ALBP-HRC with cycle time number operators (humans robots) as primary secondary objective, respectively. addition traditional ALBP constraints, human robot characteristics, terms task times, allowing multiple at stations, their joint/collaborative are formulated into a new mixed-integer linear programming (MILP) model. A neighborhood-search simulated annealing (SA) is proposed customized solution representation neighborhood search designed fit characteristics. Furthermore, SA features an adaptive selection mechanism enables utilize its exploration history dynamically choose appropriate evolves. The MILP implemented on real cases taken from industry stations for computational results over different show produces promising solutions compared other swarm intelligence algorithms, namely genetic algorithm, particle optimization, artificial bee colony. comparisons human/robot versus HRC settings case indicate significant improvement when permissible stations.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Balancing and scheduling tasks in assembly lines with sequence-dependent setup times

The classical Simple Assembly Line Balancing Problem (SALBP) has been widely enriched over the past few years with many realistic approaches and much effort has been made to reduce the distance between the academic theory and the industrial reality. Despite this effort, the scheduling of the execution of tasks assigned to every workstation following the balancing of the assembly line has been s...

متن کامل

Balancing parallel assembly lines with disabled workers

In this paper we study an assembly line balancing problem that occurs in sheltered worker centers for the disabled, where workers with very different characteristics are present. We are interested in the situation in which complete parallel assembly lines are allowed and name the resulting problem as parallel assembly line worker assignment and balancing problem (PALWABP). This approach enables...

متن کامل

Balancing assembly lines with tabu search

Balancing assembly lines is a crucial task for manufacturing companies in order to improve productivity and minimize production costs. Despite some progress in exact methods to solve large scale problems, softwares implementing simple heuristics are still the most commonly used tools in industry. Some metaheuristics have also been proposed and shown to improve on classical heuristics but, to ou...

متن کامل

Absalom: Balancing assembly lines with assignment restrictions

Assembly line balancing problems (ALBPs) arise whenever an assembly line is configured, redesigned or adjusted. An ALBP consists of distributing the total workload for manufacturing products among the work stations along the line. On the one hand, research has focussed on developing effective and fast solution methods for exactly solving the simple assembly line balancing problem (SALBP). On th...

متن کامل

Simultaneous Balancing and Scheduling of Flexible Mixed Model Assembly Lines with Sequence-Dependent Setup Times

We consider Simultaneous Balancing and Scheduling of Flexible Mixed Model Assembly Lines with Sequence-Dependent Setup Times (SBSFMMAL-SDST). We propose alternate Mixed Integer Programming (MIP) and Constraint Programming (CP) formulations. Our experiments show that while the MIP models could not solve relatively small instances, the CP approach seems more promising.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Operations Research

سال: 2022

ISSN: ['0305-0548', '1873-765X']

DOI: https://doi.org/10.1016/j.cor.2021.105674